Abelian Primitive Words
نویسندگان
چکیده
We investigate Abelian primitive words, which are words that are not Abelian powers. We show the set of Abelian primitive words is not context-free. We can determine whether a word is Abelian primitive in linear time. Also different from classical primitive words, we find that a word may have more than one Abelian root. We also consider enumeration of Abelian primitive words.
منابع مشابه
Abelian-primitive partial words
In this paper we count the number of abelian-primitive partial words of a given length over a given alphabet size, which are partial words that are not abelian powers. Partial words are sequences that may have undefined positions called holes. This combinatorial problem was considered recently for full words (those without holes). It turns out that, even for the full word case, it is a nontrivi...
متن کاملGenerating the Pseudo-Powers of a Word
The notions of power of word, periodicity and primitivity are intrinsically connected to the operation of catenation, that dynamically generates word repetitions. When considering generalizations of the power of a word, other operations will be the ones that dynamically generate such pseudo-repetitions. In this paper we define and investigate the operation of θ-catenation that gives rise to the...
متن کاملAbelian Properties of Words
We say that two finite words u and v are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian properties of words including abelian complexity, and abelian powers. We study the abelian complexity of the Thue-Morse word and the Tribonacci word, and answer an o...
متن کاملSome Properties of Abelian Return Words
We investigate some properties of abelian return words as recently introduced by Puzynina and Zamboni. In particular, we obtain a characterization of Sturmian words with nonzero intercept in terms of the finiteness of the set of abelian return words to all prefixes. We describe this set of abelian returns for the Fibonacci word but also for the 2-automatic Thue–Morse word. We also investigate t...
متن کاملAbelian returns in Sturmian words
Return words constitute a powerful tool for studying symbolic dynamical systems. They may be regarded as a discrete analogue of the first return map in dynamical systems. In this paper we investigate two abelian variants of the notion of return word, each of them gives rise to a new characterization of Sturmian words. We prove that a recurrent infinite word is Sturmian if and only if each of it...
متن کامل